A class of error-correcting pooling designs over complexes
نویسندگان
چکیده
As a generalization of d-disjunct matrices and (w, r;d)-cover-freefamilies, the notion of (s, l)-disjunct matrices is introduced for error-correcting pooling designs over complexes (or set pooling designs). We show that (w, r, d)cover-free-families form a class of (s, l)-disjunct matrices. Moreover, a decoding algorithm for pooling designs based on (s, l)-disjunct matrices is considered.
منابع مشابه
Constructing error-correcting pooling designs with symplectic space
We construct a family of error-correcting pooling designs with the incidence matrix of two types of subspaces of symplectic spaces over finite fields. We show that the new construction gives better ratio of efficiency compared with previously known three constructions associated with subsets of a set, its analogue over a vector space, and the dual spaces of a symplectic space.
متن کاملSome Error-Correcting Pooling Designs Associated with Johnson Graphs and Grassmann Graphs
Based on the inclusion matrices of t-cliques with various sizes of Johnson graphs J(n, t) and Grassmann graphs Jq(n, t) respectively, two families of errorcorrecting pooling designs are given, some of their properties including the errorcorrecting capability together with two parameters ed and e≤dare studied. With an interpretation of matchings K2m of as 2-cliques of Johnson graph J(n, 2), this...
متن کاملA Construction of Pooling Designs with Some Happy Surprises
The screening of data sets for "positive data objects" is essential to modern technology. A (group) test that indicates whether a positive data object is in a specific subset or pool of the dataset can greatly facilitate the identification of all the positive data objects. A collection of tested pools is called a pooling design. Pooling designs are standard experimental tools in many biotechnic...
متن کاملNew Construction of Error-Tolerant Pooling Designs
We present a new class of error-tolerant pooling designs by constructing d−disjunct matrices associated with subspaces of a finite vector space.
متن کاملTwo constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2
In this paper, we construct two classes of t × n, s-disjunct matrix with subspaces in orthogonal space F(2ν+1) q of characteristic 2 and exhibit their disjunct properties. We also prove that the test efficiency t/n of constructions II is smaller than that of D’yachkov et al. (J. Comput. Biol. 12:1129–1136, 2005).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 19 شماره
صفحات -
تاریخ انتشار 2010